Kernel: Python 3 (ipykernel)
In [17]:
In [3]:
In [19]:
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
У нас в лекциях, кстати, не ЦЛП!
In [20]:
In [21]:
# ==========================================================
# = Solver Results =
# ==========================================================
# ----------------------------------------------------------
# Problem Information
# ----------------------------------------------------------
Problem:
- Name: unknown
Lower bound: 21.0
Upper bound: 21.0
Number of objectives: 1
Number of constraints: 56
Number of variables: 39
Number of binary variables: 39
Number of integer variables: 39
Number of nonzeros: 28
Sense: maximize
# ----------------------------------------------------------
# Solver Information
# ----------------------------------------------------------
Solver:
- Status: ok
User time: -1.0
System time: 0.22
Wallclock time: 0.24
Termination condition: optimal
Termination message: Model was solved to optimality (subject to tolerances), and an optimal solution is available.
Statistics:
Branch and bound:
Number of bounded subproblems: 0
Number of created subproblems: 0
Black box:
Number of iterations: 834
Error rc: 0
Time: 0.31852054595947266
# ----------------------------------------------------------
# Solution Information
# ----------------------------------------------------------
Solution:
- number of solutions: 0
number of solutions displayed: 0
x[1] 1.0
x[3] 1.0
x[7] 1.0
x[8] 1.0
x[11] 1.0
y[0,1] 1.0
y[0,3] 1.0
y[0,11] 1.0
y[1,4] 1.0
y[1,6] 1.0
y[1,9] 1.0
y[1,10] 1.0
y[3,4] 1.0
y[3,5] 1.0
y[3,6] 1.0
y[3,10] 1.0
y[4,8] 1.0
y[5,11] 1.0
y[6,7] 1.0
y[6,8] 1.0
y[6,11] 1.0
y[7,9] 1.0
y[7,10] 1.0
y[8,9] 1.0
y[8,10] 1.0
y[9,11] 1.0
In [22]:
Пометим
In [0]:
In [0]:
In [0]:
In [0]:
In [0]: